Abstraction Based Reachability Analysis for Finite Branching Stochastic Hybrid Systems Zhang Wenji, Prabhakar Pavithra, Natarajan Balasubramaniam Simulation-Based Verification of Hybrid Systems involving Novel Dynamic Refinement
نویسندگان
چکیده
s (in presentation order) 6
منابع مشابه
An Algorithmic Approach to Stability Verification of Hybrid Systems: A Summary
This paper summarizes results related to a novel algorithmic approach for verifying stability of hybrid systems. The traditional approach based on Lyapunov function search suffers from several disadvantages — it relies on the user expertise to obtain good templates for the Lyapunov function; further, an unsuccessful attempt at instantiating the templates provides no insights into the choice of ...
متن کاملVerification of Hybrid Systems Based on Counterexample-Guided Abstraction Refinement
Hybrid dynamic systems include both continuous and discrete state variables. Properties of hybrid systems, which have an infinite state space, can often be verified using ordinary model checking together with a finite-state abstraction. Model checking can be inconclusive, however, in which case the abstraction must be refined. This paper presents a new procedure to perform this refinement opera...
متن کاملHybrid Automata-based CEGAR for Hybrid Systems
In this paper we present a framework for carrying out counterexample guided abstraction-refinement (CEGAR) for systems modelled as hybrid automata. The main difference, between our approach and previous proposals for CEGAR for hybrid automata, is that we consider the abstractions to be hybrid automata as well. We present a counterexample guided abstraction refinement method for systems modelled...
متن کاملFoundations of Quantitative Predicate Abstraction for Stability Analysis of Hybrid Systems
We investigate the formal connections between “quantitative predicate abstractions” for stability analysis of hybrid systems and “continuous simulation relations”. It has been shown recently that stability is not bisimulation invariant, and hence, stronger notions which extend the classical simulation and bisimulation relations with continuity constraints have been proposed, which force preserv...
متن کاملHybridization Based CEGAR for Hybrid Automata with Affine Dynamics
We consider the problem of safety verification for hybrid systems, whose continuous dynamics in each mode is affine, Ẋ = AX + b, and invariants and guards are specified using rectangular constraints. We present a counter-example guided abstraction refinement framework (CEGAR), which abstract these hybrid automata into simpler ones with rectangular inclusion dynamics, ẋ ∈ I, where x is a variabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016